The Laplacian eigenvalues of mixed graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounds on normalized Laplacian eigenvalues of graphs

*Correspondence: [email protected] 1School of Mathematics and Statistics, Minnan Normal University, Zhangzhou, Fujian, P.R. China 2Center for Discrete Mathematics, Fuzhou University, Fuzhou, Fujian, P.R. China Full list of author information is available at the end of the article Abstract Let G be a simple connected graph of order n, where n≥ 2. Its normalized Laplacian eigenvalues are 0 = λ1 ...

متن کامل

Signless Laplacian eigenvalues and circumference of graphs

In this paper, we investigate the relation between the Q -spectrum and the structure of G in terms of the circumference of G. Exploiting this relation, we give a novel necessary condition for a graph to be Hamiltonian by means of its Q -spectrum. We also determine the graphs with exactly one or two Q -eigenvalues greater than or equal to 2 and obtain all minimal forbidden subgraphs and maximal ...

متن کامل

Some remarks on Laplacian eigenvalues and Laplacian energy of graphs

Suppose μ1, μ2, ... , μn are Laplacian eigenvalues of a graph G. The Laplacian energy of G is defined as LE(G) = ∑n i=1 |μi − 2m/n|. In this paper, some new bounds for the Laplacian eigenvalues and Laplacian energy of some special types of the subgraphs of Kn are presented. AMS subject classifications: 05C50

متن کامل

Graphs with four distinct Laplacian eigenvalues

In this paper, we investigate connected nonregular graphs with four distinct Laplacian eigenvalues. We characterize all such graphs which are bipartite or have exactly one multiple Laplacian eigenvalue. Other examples of interest are also presented.

متن کامل

Some remarks on the sum of the inverse values of the normalized signless Laplacian eigenvalues of graphs

Let G=(V,E), $V={v_1,v_2,ldots,v_n}$, be a simple connected graph with $%n$ vertices, $m$ edges and a sequence of vertex degrees $d_1geqd_2geqcdotsgeq d_n>0$, $d_i=d(v_i)$. Let ${A}=(a_{ij})_{ntimes n}$ and ${%D}=mathrm{diag }(d_1,d_2,ldots , d_n)$ be the adjacency and the diagonaldegree matrix of $G$, respectively. Denote by ${mathcal{L}^+}(G)={D}^{-1/2}(D+A) {D}^{-1/2}$ the normalized signles...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2003

ISSN: 0024-3795

DOI: 10.1016/s0024-3795(02)00509-8